Solving the Capacitated Vehicle Routing Problem Based on Improved Ant-clustering Algorithm
نویسندگان
چکیده
منابع مشابه
Autonomous Units for Solving the Capacitated Vehicle Routing Problem Based on Ant Colony Optimization
Communities of autonomous units and ant colony systems have fundamental features in common. Both consists of a set of autonomously acting units that transform and move around a common environment that is usually a graph. In contrast to ant colony systems, the actions of autonomous units are specified by graph transformation rules which have a precisely defined operational semantics and can be v...
متن کاملA novel heuristic algorithm for capacitated vehicle routing problem
The vehicle routing problem with the capacity constraints was considered in this paper. It is quite difficult to achieve an optimal solution with traditional optimization methods by reason of the high computational complexity for large-scale problems. Consequently, new heuristic or metaheuristic approaches have been developed to solve this problem. In this paper, we constructed a new heuristic ...
متن کاملAPPLICATION of HYBRID ANT COLONY OPTIMIZATION (HACO) AlGORITHM for SOLVING CAPACITATED VEHICLE ROUTING PROBLEM (CVRP)
The Capacitated Vehicle Routing problem (CVRP) is a combinatorial optimization and nonlinear problem seeking to service a number of customers with a fleet of vehicles. CVRP isan important problem in the fields of transportation, distribution and logistics . Usually, the goal is delivering goods located at a central depot to customers who have placed orders. This transportation optimization prob...
متن کاملAn Evolutionary Algorithm Based on Repeated Mutations for Solving the Capacitated Vehicle Routing Problem
The capacitated vehicle routing problem (CVRP) is an interesting combinatorial optimization task, which occurs frequently in real-world applications [28]. The problem deals with scheduling a fleet of vehicles to distribute goods between depots and customers. A set of routes for vehicles should be determined, which are in some sense optimal, e.g. the shortest or the cheapest. Certain constraints...
متن کاملModeling and Solving the Capacitated Vehicle Routing Problem on Trees
Capacitated vehicle routing problems (CVRPs) form the core of logistics planning and are hence of great practical and theoretical interest. This chapter considers the CVRP on trees (TCVRP), a problem that often naturally arises in railway, river, and rural road networks. Our objective is to build high-quality models that exploit the tree structure of the problem that can also be easily implemen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2015
ISSN: 2261-236X
DOI: 10.1051/matecconf/20152203022